import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: a1227
 * Date: 2022-09-08
 * Time: 16:07
 */
public class Test {
    /**
     * 图像相似度
     * @param args
     */
    /*
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int m = scan.nextInt();
        int n = scan.nextInt();
        int[][] ary1 = new int[m][n];
        int[][] ary2 = new int[m][n];
        int same = 0;
        for(int i = 0; i < ary1.length; i++){
            for(int j = 0; j < ary1[i].length; j++){
                ary1[i][j] = scan.nextInt();
            }
        }
        for(int i = 0; i < ary1.length; i++){
            for(int j = 0; j < ary1[i].length; j++){
                ary2[i][j] = scan.nextInt();
            }
        }
        for(int i = 0; i < ary1.length; i++){
            for(int j = 0; j < ary1[i].length; j++){
                if(ary1[i][j] == ary2[i][j]){
                    same++;
                }
            }
        }
        int sum = m * n;
        System.out.printf("%.2f\n",same * 1.0 / sum * 100);
    }
    */

    /**
     * 序列重组矩阵
     * @param args
     */
    /*
    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int [][] ary = new int[n][m];
        for(int i = 0; i < n;  i++){
            for(int j = 0; j < m; j++){
                ary[i][j] = scan.nextInt();
            }
        }
        for(int i = 0; i < n ; i++){
            for(int j = 0; j < m; j++){
                System.out.print(ary[i][j]+" ");
            }
            System.out.println();
        }
    }
    */

    /**
     * 矩阵交换
     * @param args
     */
    /*
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int [][] ary = new int[n][m];
        for(int i = 0; i < ary.length; i++){
            for(int j = 0; j < ary[i].length; j++){
                ary[i][j] = scan.nextInt();
            }
        }
        //交换的次数
        int k = scan.nextInt();
        while(k != 0){
            int t = scan.next().charAt(0);
            int a = scan.nextInt();
            int b = scan.nextInt();
            if(t == 'r'){
                for(int i = 0; i < m; i++){
                    int tmp = ary[a - 1][i];
                    ary[a - 1][i] = ary[b - 1][i];
                    ary[b - 1][i] = tmp;
                }
            }else if(t == 'c'){
                for(int i = 0; i < n; i++){
                    int tmp = ary[i][a - 1];
                    ary[i][a - 1] = ary[i][b - 1];
                    ary[i][b - 1] = tmp;
                }
            }else{
                k--;
                continue;
            }
            k--;
        }
        for(int i = 0; i < ary.length; i++){
            for(int j = 0; j < ary[i].length; j++){
                System.out.print(ary[i][j]+" ");
            }
            System.out.println();
        }
    }
    */
}
